Zeta matrices of elliptic curves
نویسندگان
چکیده
منابع مشابه
Non-Abelian Zeta Functions for Elliptic Curves
In this paper, new local and global non-abelian zeta functions for elliptic curves are defined using moduli spaces of semi-stable bundles. To understand them, we also introduce and study certain refined Brill-Noether locus in the moduli spaces. Examples of these new zeta functions and a justification of using only semi-stable bundles are given too. We end this paper with an appendix on the so-c...
متن کاملTorsion points and matrices defining elliptic curves
Let k be an algebraically closed field, char k 6= 2, 3, and let X ⊂ P be an elliptic curve with defining polynomial f . We show that any non-trivial torsion point of order r, determines up to equivalence, a unique minimal matrix Φr of size 3r×3r with linear polynomial entries such that det Φr = f . We also show that the identity, thought of as the trivial torsion point of order r, determines up...
متن کاملThe Igusa local zeta functions of elliptic curves
We determine the explicit form of the Igusa local zeta function associated to an elliptic curve. The denominator is known to be trivial. Here we determine the possible numerators and classify them according to the KodairaNéron classification of the special fibers of elliptic curves as determined by Tate’s algorithm.
متن کاملElliptic Curves, Rank in Families and Random Matrices
This survey paper contains two parts. The first one is a written version of a lecture given at the “Random Matrix Theory and L-functions” workshop organized at the Newton Institute in July 2004. This was meant as a very concrete and down to earth introduction to elliptic curves with some description of how random matrices become a tool for the (conjectural) understanding of the rank of MordellW...
متن کاملA new cryptosystem based on elliptic curves and polynomial matrices*
The system we propose is a mathematical problem with the necessary properties to define public key cryptosystems. It is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) and polynomial matrices. In this way, we achieve to increase the possible number of keys and, therefore, we augment the resolution complexity of the system. Also, we make a cryptanalisys of the system detecting its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1982
ISSN: 0022-314X
DOI: 10.1016/0022-314x(82)90036-1